Rumor evolution in social networks
نویسندگان
چکیده
منابع مشابه
Rumor Evolution in Social Networks
Yichao Zhang, Shi Zhou, Jihong Guan, and Shuigeng Zhou Department of Computer Science and Technology, Tongji University, 4800 Cao’an Road, Shanghai 201804, China Department of Computer Science, University College London, Gower Street, London, WC1E 6BT, United Kingdom School of Computer Science, Fudan University, Shanghai 200433, China and Shanghai Key Lab of Intelligent Information Processing, ...
متن کاملCost Effective Rumor Containment in Social Networks
The spread of rumors through social media and online social networks can not only disrupt the daily lives of citizens but also result in loss of life and property. A rumor spreads when individuals, who are unable decide the authenticity of the information, mistake the rumor as genuine information and pass it on to their acquaintances. We propose a solution where a set of individuals (based on t...
متن کاملUltra-fast rumor spreading in social networks
We analyze the popular push-pull protocol for spreading a rumor in networks. Initially, a single node knows of a rumor. In each succeeding round, every node chooses a random neighbor, and the two nodes share the rumor if one of them is already aware of it. We present the first theoretical analysis of this protocol on random graphs that have a power law degree distribution with an arbitrary expo...
متن کاملA computational model and convergence theorem for rumor dissemination in social networks
The spread of rumors, which are known as unverified statements of uncertain origin, may threaten the society and it's controlling, is important for national security councils of countries. If it would be possible to identify factors affecting spreading a rumor (such as agents’ desires, trust network, etc.) then, this could be used to slow down or stop its spreading. Therefore, a computational m...
متن کاملWord of Mouth: Rumor Dissemination in Social Networks
In this paper we examine the diffusion of competing rumors in social networks. Two players select a disjoint subset of nodes as initiators of the rumor propagation, seeking to maximize the number of persuaded nodes. We use concepts of game theory and location theory and model the selection of starting nodes for the rumors as a strategic game. We show that computing the optimal strategy for both...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2013
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.87.032133